Centrally symmetric polytopes with many faces
نویسنده
چکیده
We present explicit constructions of centrally symmetric polytopes with many faces: (1) we construct a d-dimensional centrally symmetric polytope P with about 3d/4 ≈ (1.316)d vertices such that every pair of non-antipodal vertices of P spans an edge of P , (2) for an integer k ≥ 2, we construct a d-dimensional centrally symmetric polytope P of an arbitrarily high dimension d and with an arbitrarily large number N of vertices such that for some 0 < δk < 1 at least (1 − (δk) d) (N k ) k-subsets of the set of vertices span faces of P , and (3) for an integer k ≥ 2 and α > 0, we construct a centrally symmetric polytope Q with an arbitrarily large number of vertices N and of dimension d = k1+o(1) such that at least ( 1− k−α ) (N k ) k-subsets of the set of vertices span faces of Q.
منابع مشابه
Face Numbers of Centrally Symmetric Polytopes Produced from Split Graphs
We analyze a remarkable class of centrally symmetric polytopes, the Hansen polytopes of split graphs. We confirm Kalai’s 3d conjecture for such polytopes (they all have at least 3d nonempty faces) and show that the Hanner polytopes among them (which have exactly 3d nonempty faces) correspond to threshold graphs. Our study produces a new family of Hansen polytopes that have only 3d + 16 nonempty...
متن کاملA Centrally Symmetric Version of the Cyclic Polytope
We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes with n vertices of a given even dimension d = 2k when d is fixed and n grows. For a fixed even dimension d = 2k and an integer 1 ≤ j < k we prove that the maxi...
متن کاملExplicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets
We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3 ≈ (1.73) vertices and of centrally symmetric k-neighborly d-polytopes with about 2 2 2 k vertices. Using this result, we construct for a fixed k ≥ 2 and arbitrarily large d and N , a centrally symmetric d-polytope with N vertices that has at least ( 1− k · (γk) ) ( N k ) faces of dimension...
متن کاملSymmetrization procedures and convexity in centrally symmetric polytopes
Univariate symmetrization technique has many good properties. In this paper, we adopt the high-dimensional viewpoint, and propose a new symmetrization procedure in arbitrary (convex) polytopes of R with central symmetry. Moreover, the obtained results are used to extend to the arbitrary centrally symmetric polytopes the well-known Hermite-Hadamard inequality for convex functions.
متن کاملOn the number of faces of centrally-symmetric simplicial polytopes
I. Bfirfiny and L. Lovfisz [Acta Math. Acad. Sci. Hung. 40, 323-329 (1982)] showed that a d-dimensional centrally-symmetric simplicial polytope ~ has at least 2 d facets, and conjectured a lower bound for the number f~ of i-dimensional faces o f ~ in terms ofd and the number f0 = 2n of d vertices. Define integers ho . . . . . he by Z f~-1(x 1) d-' = ~ hi xd-'. A. Bj6rner conjectured (uni=O i=O ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011